Competitive Memetic Algorithms for Arc Routing Problems
نویسندگان
چکیده
منابع مشابه
Competitive Memetic Algorithms for Arc Routing Problems
Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Competitive memetic algorithms for arc routing problems – P. Lacomme et al. Abstract The Capacitated Arc Routing Problem or CARP arises in applications like waste collection or winter gritting. Metaheuristics are tools of choice for solving large instances of this NP-hard problem. The paper presents basic components tha...
متن کاملEvolutionary Algorithms for Multiperiod Arc Routing Problems
The Capacitated Arc Routing Problem (CARP) is useful for modeling urban waste collection or winter gritting, at the operational decision level. Many applications require a tactical version, the periodic CARP (PCARP), in which the trips are planned over a multiperiod horizon, subject to frequency constraints. The paper presents this new and hard theoretical problem, its variants, and a powerful ...
متن کاملApproximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
We show that any α(n)-approximation algorithm for the n-vertex metric asymmetric Traveling Salesperson problem yields O(α(C))-approximation algorithms for various mixed, windy, and capacitated arc routing problems. Herein, C is the number of weakly-connected components in the subgraph induced by the positive-demand arcs, a number that can be expected to be small in applications. In conjunction ...
متن کاملEvolutionary Algorithms for Capacitated Arc Routing problems with Time Windows
The Capacitated Arc Routing Problem (CARP) involves vehicles routing, serving a set of arcs in a network. This NP hard problem is extended to take into account time windows, entailing a new and hard theoretical model in arc routing called the CARPTW (CARP with time windows). The CARPTW is useful for modeling urban waste collection or winter gritting. This paper presents this new model and a mem...
متن کاملDissimilar arc routing problems
Money collection presents particular problems in terms of effective vehicle routing. Planning the collection or distribution of money for ATMs or parking meters gives rise to two problems: while the total collecting time should be minimized, tours on successive days should be different to prevent robberies. The combination of these two problems is named as the Dissimilar Routing Problem. When t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2004
ISSN: 0254-5330
DOI: 10.1023/b:anor.0000039517.35989.6d